#include "sortstrategy.h"
#include "bubblesort.h"

#include <stdio.h>


using std::vector;


void BubbleSort::sort(vector<Edge> &v)
{
	for (int i = 0; i != (int) v.size(); ++i)
		for (int j = (int) v.size() - 1; j > i; j--)
			if (v[j - 1].cost > v[j].cost)
				std::swap(v[j - 1], v[j]);	
}

